Fast Dictionary Learning for Sparse Representations of Speech Signals
نویسندگان
چکیده
منابع مشابه
Sparse Representations for Fast, One-Shot Learning
Humans rapidly and reliably learn many kinds of regularities and generalizations. We propose a novel model of fast learning that exploits the properties of sparse representations and the constraints imposed by a plausible hardware mechanism. To demonstrate our approach we describe a computational model of acquisition in the domain of morphophonology. We encapsulate phonological information as b...
متن کاملNon-Parametric Bayesian Dictionary Learning for Sparse Image Representations
Non-parametric Bayesian techniques are considered for learning dictionaries for sparse image representations, with applications in denoising, inpainting and compressive sensing (CS). The beta process is employed as a prior for learning the dictionary, and this non-parametric method naturally infers an appropriate dictionary size. The Dirichlet process and a probit stick-breaking process are als...
متن کاملDictionary Learning with Large Step Gradient Descent for Sparse Representations
This work presents a new algorithm for dictionary learning. Existing algorithms such as MOD and K-SVD often fail to find the best dictionary because they get trapped in a local minimum. Olshausen and Field’s Sparsenet algorithm relies on a fixed step projected gradient descent. With the right step, it can avoid local minima and converge towards the global minimum. The problem then becomes to fi...
متن کاملThresholded smoothed-l0(SL0) dictionary learning for sparse representations
In this paper, we suggest to use a modified version of Smoothed-!0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in...
متن کاملThresholded Smoothed- (sl0) Dictionary Learning for Sparse Representations
In this paper, we suggest to use a modified version of Smoothed0 (SL0) algorithm in the sparse representation step of iterative dictionary learning algorithms. In addition, we use a steepest descent for updating the non unit columnnorm dictionary instead of unit column-norm dictionary. Moreover, to do the dictionary learning task more blindly, we estimate the average number of active atoms in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2011
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2011.2157892